A measure of betweenness centrality based on random walks
نویسندگان
چکیده
منابع مشابه
A measure of betweenness centrality based on random walks
Betweenness is a measure of the centrality of a node in a network, and is normally calculated as the fraction of shortest paths between node pairs that pass through the node of interest. Betweenness is, in some sense, a measure of the influence a node has over the spread of information through the network. By counting only shortest paths, however, the conventional definition implicitly assumes ...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملRefining Approximating Betweenness Centrality Based on Samplings
Betweenness Centrality (BC) is an important measure used widely in complex network analysis, such as social network, web page search, etc. Computing the exact BC values is highly time consuming. Currently the fastest exact BC determining algorithm is given by Brandes, taking O(nm) time for unweighted graphs and O(nm+n log n) time for weighted graphs, where n is the number of vertices and m is t...
متن کاملOn the distribution of betweenness centrality in random trees
Betweenness centrality is a quantity that is frequently used to measure how ‘central’ a vertex v is. It is defined as the sum, over pairs of vertices other than v, of the proportions of shortest paths that pass through v. In this paper, we study the distribution of the betweenness centrality in random trees and related, subcritical graph families. Specifically, we prove that the betweenness cen...
متن کاملAlternatives to Betweenness Centrality: a Measure of Correlation Coefficient
In this paper, we measure and analyze the correlation of betweenness centrality (BWC) to five centrality measures, including eigenvector centrality (EVC), degree centrality (DEG), clustering coefficient centrality (CCC), farness centrality (FRC), and closeness centrality (CLC). We simulate the evolution of random networks and small-world networks to test the correlation between BWC and the five...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Networks
سال: 2005
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2004.11.009